Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes

Vehicle routing with stochastic time-dependent travel times

Assigning and scheduling vehicle routes in a stochastic timedependent environment is a crucial management problem. The assumption that in a real-life environment everything goes according to an a priori determined static schedule is unrealistic. Our methodology builds on earlier work in which the traffic congestion is captured based on queueing theory in an analytical way and applied to the V R...

Ambulance location and relocation problems with time-dependent travel times

EMERGENCY SERVICE PROVIDERS ARE FACING THE FOLLOWING PROBLEM: how and where to locate vehicles in order to cover potential future demand effectively. Ambulances are supposed to be located at designated locations such that in case of an emergency the patients can be reached in a time-efficient manner. A patient is said to be covered by a vehicle if (s)he can be reached by an ambulance within a p...

A Sampling-Based Metaheuristic for the Orienteering Problem with Stochastic Travel Times

Hybrid Sampling-Based Evaluators for the Orienteering Problem with Stochastic Travel and Service Times

Stochastic Combinatorial Optimization Problems (SCOPs) are many times used to model more accurately realistic situations. However, the stochasticity introduced also perplexes the computation of the objective function making it either difficult to solve or in our case very timeconsuming. In this paper, we present different techniques of evaluating the objective function of the Orienteering Probl...

Dynamic Stochastic Orienteering Problems

Orienteering problems (OPs) are a variant of the well-known prize-collecting traveling salesman problem, where the salesman needs to choose a subset of cities to visit within a given deadline. OPs and their extensions with stochastic travel times (SOPs) have been used to model vehicle routing problems and tourist trip design problems. However, they suffer from two limitations – travel times bet...